Metric Semantics for Synchronous and Asynchronous Communication: A Continuation-based Approach

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Continuation Semantics for Asynchronous Concurrency

The paper presents a method of reasoning about the behaviour of asynchronous programs in denotational models designed with metric spaces and continuation semantics for concurrency.

متن کامل

On Asynchronous Communication Semantics

This paper presents some results concerning equational theories for an elementary calculus based on a fragment of Milner's-calculus. The system is interesting because it realises asynchronous message passing not by extending but reducing the original fragment, while preserving the computational power. The bisimulation based on a novel asynchronous transition system is introduced and studied. Pr...

متن کامل

On Synchronous and Asynchronous Communication Paradigms

The π-calculus, its asynchronous version and Boudol’s mapping from the former language to the latter one are well-known mathematical objects in theoretical computer science. It is also well-known that the mapping is not fully-abstract w.r.t. most of the semantics defined over these two languages. In this paper we study and fix conditions on the existence of fully-abstract results for Boudol’s m...

متن کامل

Operational Semantics for PBC with Asynchronous Communication

This paper presents two related algebras which can be used to specify and analyse concurrent systems with synchronous and asynchronous communications. The first algebra is based on a class of P/T-nets, called boxes, and their standard transition firing rule. It is an extension of the Petri Box Calculus (PBC). Essentially, the original model is enriched with the introduction of special ‘buffer’ ...

متن کامل

Synchronous and Asynchronous Group Communication (long Version)

In distributed systems, high service availability can be achieved by letting a group of servers replicate the service state; if some servers fail, the surviving ones know the service state and can continue to provide the service. Group communication services, such as membership and atomic broadcast, have been proposed to solve the problem of maintaining server state replica consistency. Group m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 2000

ISSN: 1571-0661

DOI: 10.1016/s1571-0661(05)80632-2